order-preserving homomorphism

См. также в других словарях:

• homomorphism — homomorphous, adj. /hoh meuh mawr fiz euhm, hom euh /, n. 1. Biol. correspondence in form or external appearance but not in type of structure or origin. 2. Bot. possession of perfect flowers of only one kind. 3. Zool. resemblance between the… …   Universalium

• Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… …   Wikipedia

• Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… …   Wikipedia

• Limit-preserving function (order theory) — In the mathematical area of order theory, one often speaks about functions that preserve certain limits, i.e. certain suprema or infima. Roughly speaking, these functions map the supremum/infimum of a set to the supremum/infimum of the image of… …   Wikipedia

• Hyperreal number — *R redirects here. For R*, see Rockstar Games. The system of hyperreal numbers represents a rigorous method of treating the infinite and infinitesimal quantities. The hyperreals, or nonstandard reals, *R, are an extension of the real numbers R… …   Wikipedia

• Adjoint functors — Adjunction redirects here. For the construction in field theory, see Adjunction (field theory). For the construction in topology, see Adjunction space. In mathematics, adjoint functors are pairs of functors which stand in a particular… …   Wikipedia

• Complete Boolean algebra — This article is about a type of mathematical structure. For complete sets of Boolean operators, see Functional completeness. In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound) …   Wikipedia

• Valuation (algebra) — In algebra (in particular in algebraic geometry or algebraic number theory), a valuation is a function on a field that provides a measure of size or multiplicity of elements of the field. They generalize to commutative algebra the notion of size… …   Wikipedia

• Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… …   Wikipedia

• Orthogonal group — Group theory Group theory …   Wikipedia

• Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… …   Wikipedia